Atmospheres of polygons and knotted polygons
نویسندگان
چکیده
منابع مشابه
Knotted polygons with curvature in Z 3
The knot probability of semiflexible polygons on the cubic lattice is investigated. The degree of stiffness of the polygon is mimicked by introducing a bending fugacity conjugate to the curvature of the polygon. By generalizing Kesten’s pattern theorem to semiflexible walks, we show that for any finite value of the bending fugacity all except exponentially few sufficiently long polygons are kno...
متن کاملUnknots with highly knotted control polygons
An example is presented of a cubic Bézier curve that is the unknot (a knot with no crossings), but whose control polygon is knotted. It is also shown that there is no upper bound on the number of crossings in the control polygon for an unknotted Bézier curve. These examples complement known upper bounds on the number of subdivisions sufficient for a control polygon to be ambient isotopic to its...
متن کاملGuarding Fat Polygons and Triangulating Guarded Polygons
In this paper we study three related problems: (i) Given a fat polygon P , we show how to find a set G of points in P such that every point on the boundary of P sees at least one point of G. The set G is said to guard the boundary of P and its cardinality depends on the shape parameters of P . Fat polygons are often used to model more realistic inputs. (ii) Given k points that guard the boundar...
متن کاملConvexity of Sub-polygons of Convex Polygons
A convex polygon is defined as a sequence (V0, . . . , Vn−1) of points on a plane such that the union of the edges [V0, V1], . . . , [Vn−2, Vn−1], [Vn−1, V0] coincides with the boundary of the convex hull of the set of vertices {V0, . . . , Vn−1}. It is proved that all sub-polygons of any convex polygon with distinct vertices are convex. It is also proved that, if all sub-(n − 1)-gons of an n-g...
متن کاملDissections of Polygons into Convex Polygons
In the paper we present purely combinatorial conditions that allow us to recognize the topological equivalence (or non-equivalence) of two given dissections. Using a computer program based on this result, we are able to generate a set which contains all topologically non-equivalent dissections of a p0-gon into convex pi-gons, i = 1, ..., n, where n, p0, ..., pn are integers such that n ≥ 2, pi ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2008
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8113/41/10/105002